- logarithmic graphs
- • графика в логаритмичен мащаб
English-Bulgarian polytechnical dictionary . 2013.
logarithmic graphs
Look at other dictionaries:
Logarithmic integral function — In mathematics, the logarithmic integral function or integral logarithm li(x) is a special function. It occurs in problems of physics and has number theoretic significance, occurring in the prime number theorem as an estimate of the number of… … Wikipedia
Cartesian product of graphs — In graph theory, the cartesian product G ◻ H of graphs G and H is a graph such that * the vertex set of G ◻ H is the cartesian product V(G) × V(H) ; and * any two vertices (u,u ) and (v,v ) are adjacent in G ◻ H if and only if either ** u = v and … Wikipedia
Converting scanned graphs to data — Contents 1 Converting Scanned Graphs to Data 2 History 3 Basic Concept 4 Practical Considerations 4.1 … Wikipedia
semi-logarithmic — semˈi log or semi logarithˈmic adjective (of graph paper, graphs, etc) having an arithmetical scale on the x axis and a logarithmic scale on the y axis (also called single log or single logarithmic; cf ↑log log under ↑log2) • • • Main Entry:… … Useful english dictionary
List of integrals of logarithmic functions — The following is a list of integrals (antiderivative functions) of logarithmic functions. For a complete list of integral functions, see list of integrals. Note: x gt;0 is assumed throughout this article.: intln cx;dx = xln cx x: intln (ax +… … Wikipedia
The Singularity Is Near — The Singularity Is Near: When Humans Transcend Biology … Wikipedia
Logarithm — The graph of the logarithm to base 2 crosses the x axis (horizontal axis) at 1 and passes through the points with coordinates (2, 1), (4, 2), and (8, 3) … Wikipedia
NP-complete — Euler diagram for P, NP, NP complete, and NP hard set of problems In computational complexity theory, the complexity class NP complete (abbreviated NP C or NPC) is a class of decision problems. A decision problem L is NP complete if it is in the… … Wikipedia
Cycle rank — In graph theory, the cycle rank of a directed graph is a digraph connectivity measure proposed first by Eggan and Büchi (Eggan 1963). Intuitively, this concept measures how close a digraph is to a directed acyclic graph (DAG), in the sense that a … Wikipedia
2-satisfiability — In computer science, 2 satisfiability (abbreviated as 2 SAT or just 2SAT) is the problem of determining whether a collection of two valued (Boolean or binary) variables with constraints on pairs of variables can be assigned values satisfying all… … Wikipedia
List of mathematics articles (L) — NOTOC L L (complexity) L BFGS L² cohomology L function L game L notation L system L theory L Analyse des Infiniment Petits pour l Intelligence des Lignes Courbes L Hôpital s rule L(R) La Géométrie Labeled graph Labelled enumeration theorem Lack… … Wikipedia
